A Robust Point Sets Matching Method
نویسندگان
چکیده
Xiao Liu, Congying Han, Tiande Guo School of Mathematical Science, University of Chinese Academy of Sciences, Beijing, 100049 Abstract Point sets matching method is very important in computer vision, feature extraction, fingerprint matching, motion estimation and so on. This paper proposes a robust point sets matching method. We present an iterative algorithm that is robust to noise case. Firstly, we calculate all transformations between two points. Then similarity matrix are computed to measure the possibility that two transformation are both true. We iteratively update the matching score matrix by using the similarity matrix. By using matching algorithm on graph, we obtain the matching result. Experimental results obtained by our approach show robustness to outlier and jitter.
منابع مشابه
Using k-d Trees for Robust 3D Point Pattern Matching
We propose a new method for matching two 3D point sets of identical cardinality with global similarity but locally non-rigid distribution. This problem arises from markerbased optical motion capture systems. The point-sets are extracted from similar design poses of two subjects with underlying non-rigidity and possible distribution discrepancies, one being a model set (manually identified) and ...
متن کاملPoint Pattern Matching with Robust Spectral Correspondence
This paper investigates the correspondence matching of point-sets using spectral graph analysis. In particular we are interested in the problem of how the modal analysis of point-sets can be rendered robust to contamination and drop-out. We make three contributions. First, we show how the modal structure of point-sets can be embedded within the framework of the EM algorithm. Second, we present ...
متن کاملCorrespondence Matching with Modal Clusters
—The modal correspondence method of Shapiro and Brady aims to match point-sets by comparing the eigenvectors of a pairwise point proximity matrix. Although elegant by means of its matrix representation, the method is notoriously susceptible to differences in the relational structure of the point-sets under consideration. In this paper, we demonstrate how the method can be rendered robust to str...
متن کاملAlignment using Spectral Clusters
This paper describes a hierarchical spectral method for the correspondence matching of point-sets. Conventional spectral methods for correspondence matching are notoriously susceptible to differences in the relational structure of the point-sets under consideration. In this paper we demonstrate how the method can be rendered robust to structural differences by adopting a hierarchical approach. ...
متن کامل3D point pattern matching based on spatial geometric flexibility
We propose a new method for matching two 3D point sets of identical cardinality with global similarity but local non-rigid deformations and distribution errors. This problem arises from marker based optical motion capture (Mocap) systems for facial Mocap data. To establish one-to-one identifications, we introduce a forward 3D point pattern matching (PPM) method based on spatial geometric flexib...
متن کامل